Proof Planning with IsaPlanner Tutorial Exercise
نویسنده
چکیده
IsaPlanner [1] is a proof planner for the generic interactive theorem prover Isabelle [3]. It provides a framework for the encoding and debugging of proof planning techniques. A higher order version of rippling has been implemented and augmented with generalisation and lemma calculation critics [2]. The proof planning process is interleaved with the execution of the resulting proof plans, thus ensuring the soundness of the resulting proofs, and allowing IsaPlanner to make use of Isabelle’s tactics. The generated proof plans are in terms of Isabelle/Isar proof scripts [4]. This allows proof planning techniques to automate the generation of Isar proof scripts, or to be wrapped up as tactics. We have not yet developed an interface to work with the manipulation of proof scripts. However, the debugging mode of IsaPlanner provides a way to explore the proof planning process with a given technique. In this tutorial we use the debugger to illustrate proof planning in IsaPlanner.
منابع مشابه
IsaPlanner: A Prototype Proof Planner in Isabelle
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjecture and prove theorems automatically. This paper introduces our approach to proof planning, gives and overview of IsaPlanner, and presents one simple yet effective reasoning technique.
متن کاملDennis, Louise Abigail and Jamnik, Mateja and Pollet, Martin (2005) On the comparison of proof planning systems: Lambda-clam, Omega and IsaPlanner. In: 12th Symposium on the Integratoin of Symbolic Computation
We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, λCLaM, Ωmega and IsaPlanner, and demonstrate how the framework allow...
متن کاملOn the Comparison of Proof Planning Systems λCLaM, Ωmega and IsaPlanner
We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, λCLaM, Ωmega and IsaPlanner, and demonstrate how the framework allow...
متن کاملProof-Planning Critics
Discovering unknown lemmas, generalisations and other eureka steps is a major challenge for automated theorem proving. Proof-planning critics can help automate these steps by making use of information from failed proof attempts. Our proposed research will extend existing critics for higher-order logic in the IsaPlanner system, as well as develop new critics. With the assistance of critics we ex...
متن کاملProof Critics for IsaPlanner
The discovery of missing lemmas and case-splits are challenging problems for automated theorem proving. Most interactive provers rely on the user for guidance through these proof-steps. Proof-planning critics were introduced by Ireland as a way of automating this. Here, we present ongoing work developing critics for lemma speculation and caseanalysis in higher-order logic in the IsaPlanner system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004